Combining Semidefinite and Polyhedral Relaxations for Integer Programs
نویسندگان
چکیده
We present a general framework for designing semideenite relaxations for constrained 0-1 quadratic programming and show how valid inequalities of the cut{polytope can be used to strengthen these relaxations. As examples we improve the #{function and give a semidef-inite relaxation for the quadratic knapsack problem. The practical value of this approach is supported by numerical experiments which make use of the recent development of eecient interior point codes for semideenite programming.
منابع مشابه
1 Parallel Semidefinite Programming and Combinatorial Optimization STEVEN
The use of semidefinite programming in combinatorial optimization continues to grow. This growth can be attributed to at least three factors: new semidefinite relaxations that provide tractable bounds to hard combinatorial problems, algorithmic advances in the solution of semidefinite programs (SDP), and the emergence of parallel computing. Solution techniques for minimizing combinatorial probl...
متن کاملConvex quadratic relaxations for mixed-integer nonlinear programs in power systems
Abstract This paper presents a set of new convex quadratic relaxations for nonlinear and mixed-integer nonlinear programs arising in power systems. The considered models are motivated by hybrid discrete/continuous applications where existing approximations do not provide optimality guarantees. The new relaxations offer computational efficiency along with minimal optimality gaps, providing an in...
متن کاملSolving Lift-and-Project Relaxations of Binary Integer Programs
We propose a method for optimizing the lift-and-project relaxations of binary integer programs introduced by Lovász and Schrijver. In particular, we study both linear and semidefinite relaxations. The key idea is a restructuring of the relaxations, which isolates the complicating constraints and allows for a Lagrangian approach. We detail an enhanced subgradient method and discuss its efficient...
متن کاملReformulating Mixed-Integer Quadratically Constrained Quadratic Programs
It is well known that semidefinite programming (SDP) can be used to derive useful relaxations for a variety of optimisation problems. Moreover, in the particular case of mixed-integer quadratic programs, SDP has been used to reformulate problems, rather than merely relax them. The purpose of reformulation is to strengthen the continuous relaxation of the problem, while leaving the optimal solut...
متن کاملForthcoming in Mathematical Programming CONIC MIXED-INTEGER ROUNDING CUTS
A conic integer program is an integer programming problem with conic constraints. Many problems in finance, engineering, statistical learning, and probabilistic optimization are modeled using conic constraints. Here we study mixed-integer sets defined by second-order conic constraints. We introduce general-purpose cuts for conic mixed-integer programming based on polyhedral conic substructures ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995